Regular approximate factorization of a class of matrix-function with an unstable set of partial indices
نویسندگان
چکیده
From the classic work of Gohberg & Krein (1958 Uspekhi Mat. Nauk.XIII, 3-72. (Russian).), it is well known that the set of partial indices of a non-singular matrix function may change depending on the properties of the original matrix. More precisely, it was shown that if the difference between the largest and the smallest partial indices is larger than unity then, in any neighbourhood of the original matrix function, there exists another matrix function possessing a different set of partial indices. As a result, the factorization of matrix functions, being an extremely difficult process itself even in the case of the canonical factorization, remains unresolvable or even questionable in the case of a non-stable set of partial indices. Such a situation, in turn, has became an unavoidable obstacle to the application of the factorization technique. This paper sets out to answer a less ambitious question than that of effective factorizing matrix functions with non-stable sets of partial indices, and instead focuses on determining the conditions which, when having known factorization of the limiting matrix function, allow to construct another family of matrix functions with the same origin that preserves the non-stable partial indices and is close to the original set of the matrix functions.
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملTHE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملNumerical solution of the Sturm-Liouville problem by using Chebyshev cardinal functions
In this manuscript, a numerical technique is presented for finding the eigenvalues of the regular Sturm-Liouville problems. The Chebyshev cardinal functions are used to approximate the eigenvalues of a regular Sturm-Liouville problem with Dirichlet boundary conditions. These functions defined by the Chebyshev function of the first kind. By using the operational matrix of derivative the problem ...
متن کاملSome local fixed point results under $C$-class functions with applications to coupled elliptic systems
The main objective of the paper is to state newly fixed point theorems for set-valued mappings in the framework of 0-complete partial metric spaces which speak about a location of a fixed point with respect to an initial value of the set-valued mapping by using some $C$-class functions. The results proved herein generalize, modify and unify some recent results of the existing literature. As an ...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 474 شماره
صفحات -
تاریخ انتشار 2018